Aggregate Semantics for Propositional Answer Set Programs

Abstract Answer set programming (ASP) emerged in the late 1990s as a paradigm for knowledge representation and reasoning. The attractiveness of ASP builds on an expressive high-level modeling language along with availability powerful off-the-shelf solving systems. While utility incorporating aggregate expressions has been realized almost simultaneously inception first systems, general semantics aggregates its efficient implementation have long-standing challenges. Aggregates proposed widely used database also deductive Datalog, which is one main precursors ASP. use was, however, still restricted Datalog (by either disallowing recursion or only allowing monotone aggregates), while several ways to integrate unrestricted evolved context In this survey, we pick up at point development by presenting comparing that propositional programs. We highlight crucial properties such computational complexity power, outline capabilities limitations different approaches illustrative examples.